Vampire Plants?

Tree Interpolation in Vampire

We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other metho...

System Description: Vampire 1.0

Invariant Generation in Vampire

This paper describes a loop invariant generator implemented in the theorem prover Vampire. It is based on the symbol elimination method proposed by two authors of this paper. The generator accepts a program written in a subset of C, finds loops in it, analyses the loops, generates and outputs invariants. It also uses a special consequence removal mode added to Vampire to remove invariants impli...

Globalisation, Empire, and the Vampire

In his paper, "Globalisation, Empire, and the Vampire," Mario Vrbančić opens up the question of the possibility of a dialectical utopian thinking in postmodernism. Following Lacanian psychoanalytic theory, Vrbančić analyses the vampire as the nation looking both at Hardt and Negri's theory of Empire and Žižek psychoanalytically inclined theory of nationalist identification. The vampire always o...

Reasoning About Loops Using Vampire

In 2009, the symbol elimination method for loop invariant generation was introduced [8], which used saturation theorem proving in first-order logic to generate quantified invariants of programs with arrays. Symbol elimination is fully automatic, requires no user guidance, and it is the first ever approach able to generate invariants with alternations of quantifiers. In this paper we describe a ...